Efficient and Effective Aggregate Keyword Search on Relational Databases
نویسندگان
چکیده
منابع مشابه
Efficient and Effective Aggregate Keyword Search on Relational Databases
Keyword search on relational databases is useful and popular for many users without technical background. Recently, aggregate keyword search on relational databases was proposed and has attracted interest. However, two important problems still remain. First, aggregate keyword search can be very costly on large relational databases, partly due to the lack of efficient indexes. Second, finding th...
متن کاملEfficient Keyword Search in Relational Databases
A user who wants to get knowledge from a relational database that needs to know about structured query languages and database schema. Mostly users are not know to those things, so searching knowledge from relational databases is difficult to them. Where a keyword query input is a simple search model that can be issued by writing a list of keywords values, keyword search that place provide a sol...
متن کاملEfficient IR-Style Keyword Search over Relational Databases
Applications in which plain text coexists with structured data are pervasive. Commercial relational database management systems (RDBMSs) generally provide querying capabilities for text attributes that incorporate state-of-the-art information retrieval (IR) relevance ranking strategies, but this search functionality requires that queries specify the exact column or columns against which a given...
متن کاملGraph-driven Exploration of Relational Databases for Efficient Keyword Search
Keyword-based search is becoming the standard way to access any kind of information and it is considered today an important add-on of relational database management systems. The approaches to keyword search over relational data usually rely on a two-step strategy in which, first, tree-shaped answers are built by connecting tuples matching the given keywords and, then, potential answers are rank...
متن کاملEfficient Schema Based Keyword Search in Relational Databases
Keyword search in relational databases allows user to search information without knowing database schema and using structural query language (SQL). In this paper, we address the problem of generating and evaluating candidate networks. In candidate network generation, the overhead is caused by raising the number of joining tuples for the size of minimal candidate network. To reduce overhead, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Warehousing and Mining
سال: 2012
ISSN: 1548-3924,1548-3932
DOI: 10.4018/jdwm.2012100103